91 research outputs found
Semigroups with the Erdös-Turán Property
A set X in a semigroup G has the Erdös-Turán property ET if,
for any basis A of X, the representation function rA is ubounded,
where rA(x) counts the number of representations of x as a product
two elements in A. We show that, under some conditions, operations
on binary vectors whose value at each coordinate depends only on
neighbouring coordinates of the factors give rise to semigroups with
the ET{property. In particular countable powers of semigroups with
no mutually inverse elements have the ET{property. As a consequence,
for each k there is N(k) such that, for every ¯nite subset X of a group
G with X \ X¡1 = f1g, the representation function of every basis of
XN ½ GN, N ¸ N(k), is not bounded by k. This is in contrast with
the known fact that each p{elementary group admits a basis of the
whole group whose representation function is bounded by an absolute
constan
Oriented coloring: complexity and approximation
International audienceThis paper is devoted to an oriented coloring problem motivated by a task assignment model. A recent result established the NP-completeness of deciding whether a digraph is k-oriented colorable; we extend this result to the classes of bipartite digraphs and circuit-free digraphs. Finally, we investigate the approximation of this problem: both positive and negative results are devised
Splitting finite antichains in the homomorphism order
A structural condition is given for finite maximal antichains in the homomorphism order of relational structures to have the splitting property. It turns out that non-splitting antichains appear only at the bottom of the order. Moreover, we examine looseness and finite antichain extension property for some subclasses of the homomorphism poset. Finally, we take a look at cut-points in this order
Modulo-Counting First-Order Logic on Bounded Expansion Classes
We prove that, on bounded expansion classes, every first-order formula with
modulo counting is equivalent, in a linear-time computable monadic lift, to an
existential first-order formula. As a consequence, we derive, on bounded
expansion classes, that first-order transductions with modulo counting have the
same encoding power as existential first-order transductions. Also,
modulo-counting first-order model checking and computation of the size of sets
definable in modulo-counting first-order logic can be achieved in linear time
on bounded expansion classes. As an application, we prove that a class has
structurally bounded expansion if and only if is a class of bounded depth
vertex-minors of graphs in a bounded expansion class. We also show how our
results can be used to implement fast matrix calculus on bounded expansion
matrices over a finite field.Comment: submitted to CSGT2022 special issu
Ramsey properties and extending partial automorphisms for classes of finite structures
We show that every free amalgamation class of finite structures with relations and (set-valued) functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Neˇsetˇril-R¨odl Theorem and the second and third authors’ Ramsey theorem for finite models (that is, structures with both relations and functions). We also find subclasses with the ordering property. For languages with relational symbols and unary functions we also show the extension property for partial automorphisms (EPPA) of free amalgamation classes. These general results solve several conjectures and provide an easy Ramseyness test for many classes of structures
Reconfiguration on sparse graphs
A vertex-subset graph problem Q defines which subsets of the vertices of an
input graph are feasible solutions. A reconfiguration variant of a
vertex-subset problem asks, given two feasible solutions S and T of size k,
whether it is possible to transform S into T by a sequence of vertex additions
and deletions such that each intermediate set is also a feasible solution of
size bounded by k. We study reconfiguration variants of two classical
vertex-subset problems, namely Independent Set and Dominating Set. We denote
the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete
on graphs of bounded bandwidth and W[1]-hard parameterized by k on general
graphs. We show that ISR is fixed-parameter tractable parameterized by k when
the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we
answer positively an open question concerning the parameterized complexity of
the problem on graphs of bounded treewidth. Moreover, our techniques generalize
recent results showing that ISR is fixed-parameter tractable on planar graphs
and graphs of bounded degree. For DSR, we show the problem fixed-parameter
tractable parameterized by k when the input graph does not contain large
bicliques, a class of graphs which includes graphs of bounded degeneracy and
nowhere-dense graphs
Structurally Parameterized d-Scattered Set
In -Scattered Set we are given an (edge-weighted) graph and are asked to
select at least vertices, so that the distance between any pair is at least
, thus generalizing Independent Set. We provide upper and lower bounds on
the complexity of this problem with respect to various standard graph
parameters. In particular, we show the following:
- For any , an -time algorithm, where
is the treewidth of the input graph.
- A tight SETH-based lower bound matching this algorithm's performance. These
generalize known results for Independent Set.
- -Scattered Set is W[1]-hard parameterized by vertex cover (for
edge-weighted graphs), or feedback vertex set (for unweighted graphs), even if
is an additional parameter.
- A single-exponential algorithm parameterized by vertex cover for unweighted
graphs, complementing the above-mentioned hardness.
- A -time algorithm parameterized by tree-depth
(), as well as a matching ETH-based lower bound, both for
unweighted graphs.
We complement these mostly negative results by providing an FPT approximation
scheme parameterized by treewidth. In particular, we give an algorithm which,
for any error parameter , runs in time
and returns a
-scattered set of size , if a -scattered set of the same
size exists
- …